Progress on Algorithms for Stateless Model Checking
نویسندگان
چکیده
منابع مشابه
Stateless Model Checking for POWER
We present the first framework for efficient application of stateless model checking (SMC) to programs running under the relaxed memory model of POWER. The framework combines several contributions. The first contribution is that we develop a scheme for systematically deriving operational execution models from existing axiomatic ones. The scheme is such that the derived execution models are well...
متن کاملEffective Techniques for Stateless Model Checking
Aronis, S. 2018. Effective Techniques for Stateless Model Checking. Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology 1602. 56 pp. Uppsala: Acta Universitatis Upsaliensis. ISBN 978-91-513-0160-0. Stateless model checking is a technique for testing and verifying concurrent programs, based on exploring the different ways in which operations execut...
متن کاملProgress on Model Checking Robot Behaviour
We model systems that involve a learning robot which interacts with obstacles in a static environment. Our models are specified in Promela with a view to verifying them using SPIN [2]. Because of the complex nature of these systems our initial models have intractable state-spaces: we aren’t able to model check them. Last year [4] we introduced an abstraction technique to greatly reduce the stat...
متن کاملStateless Code Model Checking of Information Flow Security
Observational determinism is a security property that characterizes secure information flow for multithreaded programs. Most of the methods that have been used to verify observational determinism are based on either type systems or conventional model checking techniques. A conventional model checker is stateful and often verifies a system model usually constructed manually. As these methods are...
متن کاملModel Checking Algorithms for CTMDPs
Continuous Stochastic Logic (CSL) can be interpreted over continuoustime Markov decision processes (CTMDPs) to specify quantitative properties of stochastic systems that allow some external control. Model checking CSL formulae over CTMDPs requires then the computation of optimal control strategies to prove or disprove a formula. The paper presents a conservative extension of CSL over CTMDPs—wit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2018
ISSN: 2075-2180
DOI: 10.4204/eptcs.268.0.2